ar X iv : 1 50 7 . 02 10 3 v 1 [ cs . S I ] 8 J ul 2 01 5 Measuring centrality by a generalization of degree ∗

نویسنده

  • László Csató
چکیده

Network analysis has emerged as a key technique in communication studies, economics, geography, history and sociology, among others. A fundamental issue is how to identify key nodes in a network, for which purpose a number of centrality measures have been developed. This paper proposes a new parametric family of centrality measures called generalized degree. It is based on the idea that a relationship to a more interconnected node contributes to centrality in a greater extent than a connection to a less central one. Generalized degree improves on degree by redistributing its sum over the network with the consideration of the global structure. Application of the measure is supported by a set of basic properties. A sufficient condition is given for generalized degree to be rank monotonic, excluding counter-intuitive changes in the centrality ranking after certain modifications of the network. The measure has a graph interpretation and can be calculated iteratively. Generalized degree is recommended to apply besides degree since it preserves most favorable attributes of degree, but better reflects the role of the nodes in the network and has an increased ability to distinguish between their importance. JEL classification number: D85, Z13 AMS classification number: 15A06, 91D30

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Faster Method to Estimate Closeness Centrality Ranking

Closeness centrality is one way of measuring how central a node is in the given network. The closeness centrality measure assigns a centrality value to each node based on its accessibility to the whole network. In real life applications, we are mainly interested in ranking nodes based on their centrality values. The classical method to compute the rank of a node first computes the closeness cen...

متن کامل

ar X iv : h ep - e x / 02 07 01 3 v 1 3 J ul 2 00 2 LHC Based ep Colliders : e - linac versus e - ring

Luminosity estimation for Linac∗LHC based ep collider is evaluated and compared to the suggested ”LEP”∗LHC type collider.

متن کامل

ar X iv : 1 10 7 . 10 76 v 1 [ cs . D S ] 6 J ul 2 01 1 Genome Halving by Block Interchange

We address the problem of finding the minimal number of block interchanges (exchange of two intervals) required to transform a duplicated linear genome into a tandem duplicated linear genome. We provide a formula for the distance as well as a polynomial time algorithm for the sorting problem.

متن کامل

Varlets: Additive Decomposition, Topological Total Variation, and Filtering of Scalar Fields

Continuous interpolation of real-valued data is characterized by piecewise monotone functions on a compact metric space. Topological total variation of piecewise monotone function f : X → R is a homeomorphisminvariant generalization of 1D total variation. A varlet basis is a collection of piecewise monotone functions {gi | i = 1 . . . n}, called varlets, such that every linear combination ∑ aig...

متن کامل

ar X iv : h ep - p h / 01 02 24 5 v 2 1 J ul 2 00 1 A Study of Light Mesons on the Transverse Lattice

We present results from a study of light meson spectra and structure obtained within the framework of light-front QCD formulated on a transverse lattice. We discuss how imposing Lorentz covariance conditions on meson dispersion relations allows determination of parameters in the transverse lattice Hamiltonian. The pion distribution amplitude obtained in this framework is rather close to its asy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015